On the Life-Long Learning Capabilities of a NELLI*: A Hyper-Heuristic Optimisation System
نویسندگان
چکیده
Real-world applications of optimisation techniques place more importance on finding approaches that result in acceptable quality solutions in a short time-frame and can provide robust solutions, capable of being modified in response to changes in the environment than seeking elusive global optima. We demonstrate that a hyper-heuristic approach NELLI* that takes inspiration from artifical immune systems is capable of life-long learning in an environment where problems are presented in a continuous stream and change over time. Experiments using 1370 bin-packing problems show excellent performance on unseen problems and that the system maintains memory, enabling it to exploit previously learnt heuristics to solve new problems with similar characteristics to ones solved in the past.
منابع مشابه
A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling
We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance set considered. NELLI-GP extends an existing ensemble method called NELLI by introducing a novel heuristic generator that evolves heuristics compo...
متن کاملHyper-heuristics Can Achieve Optimal Performance for Pseudo-Boolean Optimisation
Selection hyper-heuristics are randomised search methodologies which choose and execute heuristics from a set of low-level heuristics. Recent research for the LeadingOnes benchmark function has shown that the standard Simple Random, Permutation, Random Gradient, Greedy and Reinforcement Learning selection mechanisms show no effects of learning. The idea behind the learning mechanisms is to cont...
متن کاملHyperILS: An Effective Iterated Local Search Hyper-heuristic for Combinatorial Optimisation
Two powerful ideas from search methodologies, iterated local search and hyperheuristics, are combined into a simple and effective framework to solve combinatorial optimisation problems (HyperILS). Iterated local search is a simple but successful algorithm. It operates by iteratively alternating between applying a move operator to the incumbent solution and restarting local search from the pertu...
متن کاملHyper-heuristics: Raising the Level of Generality
Hyper-heuristics are easy-to-implement emerging search and optimisation strategies which have been used instead of meta-heuristics for providing higher level generalized structures to solve mainly combinatorial optimisation problems. The motivation behind them is generally expressed as raising the level of generality. That is, they are the answers to the following question: How can we create or...
متن کاملImproving Performance of a Hyper-heuristic Using a Multilayer Perceptron for Vehicle Routing
A hyper-heuristic is a heuristic optimisation method which generates or selects heuristics (move operators) based on a set of components while solving a computationally difficult problem. Apprenticeship learning arises while observing the behaviour of an expert in action. In this study, we use a multilayer perceptron (MLP) as an apprenticeship learning algorithm to improve upon the performance ...
متن کامل